Effects of Neighbourhood Structure on Evolution of Cooperation in N-Player Iterated Prisoner's Dilemma

نویسندگان

  • Raymond Chiong
  • Sandeep Dhakal
  • Lubo Jankovic
چکیده

In multi-agent systems, complex and dynamic interactions often emerge among individual agents. The ability of each agent to learn adaptively is therefore important for them to survive in such changing environment. In this paper, we consider the effects of neighbourhood structure on the evolution of cooperative behaviour in the N-Player Iterated Prisoner’s Dilemma (NIPD). We simulate the NIPD as a bidding game on a two dimensional grid-world, where each agent has to bid against its neighbours based on a chosen game strategy. We conduct experiments with three different types of neighbourhood structures, namely the triangular neighbourhood structure, the rectangular neighbourhood structure and the random pairing structure. Our results show that cooperation does emerge under the triangular neighbourhood structure, but defection prevails under the rectangular neighbourhood structure as well as the random pairing structure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Trust in an N-Player Iterated Prisoner's Dilemma

The iterated Prisoner's Dilemma (iPD) is a standard problem for the evolution of cooperation. Published work so far dealt mainly with the 2-player case, which is neither very realistic nor very relevant for applications , as societies, in a general sense, usually are made of more than two agents. We present novel results where cooperation co-evolves with trust in an N-player iPD. In doing so, t...

متن کامل

Genetic Algorithms and Evolutionary Games

Genetic algorithms (GAs) have been used widely in evolving game-playing strategies since the mid-1980's. This paper looks at a particular game | the iterated prisoner's dilemma game, which is of interest to many economists, social scientists, evolutionary computation researchers and computer scientists. The paper describes a computational approach which uses a GA to evolve strategies for the 2 ...

متن کامل

An Experimental Study of N-Person Iterated Prisoner's Dilemma Games

The Iterated Prisoner’s Dilemma game has been used extensively in the study of the evolution of cooperative behaviours in social and biological systems. There have been a lot of experimental studies on evolving strategies for 2-player Iterated Prisoner’s Dilemma games (2IPD). However, there are many real world problems, especially many social and economic ones, which cannot be modelled by the 2...

متن کامل

Evolution of Continuous Degrees of Cooperation in an N-Player Iterated Prisoner's Dilemma

The iterated prisoner's dilemma (iPD) in its standard form is a very well known, popular basis for research on cooperation. Here, a signiicant generalization of the iPD is presented in form of a N-player game, instead of only two players, with continuous degrees of cooperation, instead of binary cooperation or defection. This continuous N-player PD (CN-PD) is motivated and explained by an actua...

متن کامل

PSO Algorithm for IPD Game

Mechanisms promoting the evolution of cooperation in two-player, two-strategy evolutionary games have been discussed in great detail over the past decades. Understanding the effects of repeated interactions in multi-player with multi-choice is a formidable challenge. This paper presents and investigates the application of co-evolutionary training techniques based on particle swarm optimization ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007